//
// Created by Administrator on 2023/11/23.
//
#include "bits/stdc++.h"

using namespace std;

const int N = 1e5 + 10;

int h[N], e[N], ne[N], idx;

int d[N];//入度
queue<int> q, res;
int n, m;

void add(int a, int b) {
    d[b]++;
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx++;
}

void top_sort() {

    //入度为0则入队
    for (int i = 1; i <= n; ++i) {
        if (d[i] == 0) {
            res.push(i);
            q.push(i);
        }
    }

    while (!q.empty()) {
        int x = q.front();
        q.pop();
        //遍历x点所有指向的边
        for (int i = h[x]; i != -1; i = ne[i]) {
            int j = e[i];
            d[j]--;
            if (d[j] == 0) {
                res.push(j);
                q.push(j);
            }
        }
    }

    if (res.size() == n)
        for (int i = 0; i < n; ++i) {
            int x = res.front();
            res.pop();
            cout << x << ' ';
        }
    else cout << "NO!";
}

int main() {

    cin >> n >> m;
    memset(h, -1, sizeof h);
    while (m--) {
        int a, b;
        cin >> a >> b;
        add(a, b);
    }
    top_sort();
}